Implementation of Parallel Path Finding in a Shared Memory Architecture
نویسنده
چکیده
This paper investigates possible methods of parallelizing two common single source path-finding algorithms. This research could enable faster computation of optimal path planning in complex environments. Both algorithms, A* and Bellman-Ford were found to be parallelizable. After testing, A* was shown to lack good scaling potential while Bellman-Ford showed promise as a scalable parallel path finding procedure.
منابع مشابه
Parallel implementation of geometric shortest path algorithms
In application areas such as GIS, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics however increases the run-time of algorithms considerably suggesting the use of a parallel approach. In this paper, we provide a parallel imp...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملDesign and Implementation of OpenMP Library for λ Computing Environment
Our research group has proposed a new high performance computing architecture, which we call the λ computing environment. In the λ computing environment, every computing node has a shared memory connected with the optical wavelength path. In this paper, we establish the λ computing environment using the AWG–STAR system which is based on WDM technology, and we present the design and implementati...
متن کاملParallel Shortest Path Algorithms for Solving Large-Scale Instances
We present an experimental study of parallel algorithms for solving the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs. We implement Meyer and Sander’s ∆-stepping algorithm and report performance results on the Cray MTA-2, a multithreaded parallel architecture. The MTA-2 is a high-end shared memory system offering two unique features that aid the...
متن کاملCollective Memory as a Measure to Evaluate the Infill Architecture Innovations in Historic Contexts (Case Study: Historic Context of Imamzadeh Yahya in Tehran)
Historic contexts remind us of an era when cities were built based on the needs, goals, and preferences of their inhabitants. In other words, the mental world of both the builders and the inhabitants was closely interrelated. But by ignoring citizens' memories and interests and their mental needs, today's interventions with rapid developments within historic contexts have led to amnesia and the...
متن کامل